Horizontally Elastic Edge-Finder Algorithm for Cumulative Resource Constraint Revisited

The success of constraint programming on scheduling problems comes from the low complexity and power propagators. data structure Profile recently introduced by Gingras Quimper in Generalizing edge-finder rule for cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016, when applied to resource (which we call horizontally elastic edge-finder) has improved filtering this rule. In paper, algorithm proposed 2016 is revisited. It proved that can be further used more adjustments. A new formulation put forward. Similar an \(\mathcal {O}(kn^2)\) (where n number tasks sharing \(k\le n\), distinct capacities required tasks) based attributes Experimental results instances Resource-Constrained Project Scheduling Problems (RCPSPs) benchmark suites highlight using reduces backtracks majority with a slight increase running time.